Multiple construction types for nominal expressions in Australian languages

Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nom...

Nominal juxtaposition in Australian languages: An LFG analysis

It is well known that Australian languages make heavy use of nominal juxtaposition in a wide variety of functions, but there is little discussion in the theoretical literature of how such juxtapositions should be analysed. We discuss a range of data from Australian languages illustrating how multiple nominals share a single grammatical function within the clause. We argue that such construction...

Types for Nominal Rewriting?

We define a type inference system for Nominal Rewriting where the types associated to terms are polymorphic (built from a set of base data sorts, type variables, and user-defined type constructors). In contrast with standard term rewriting systems or the λ-calculus, a typing environment for nominal rewriting includes type information for atoms, variables and function symbols. We give a syntax-d...

Can Nominal Expressions Achieve Multiple Goals? An Empirical Study

Conjoined nominal expressions in Japanese

This paper studies nominal expressions in Japanese that are formed by conjoining two or more nominal expressions with conjunctions, and presents a theory of nominal expressions that captures their behaviors. In what follows, such nominal expressions are referred to as conjoined nominal expressions. In terms of their behaviors, the conjoined nominal expressions in Japanese form three categories....